Models of anagram solution
نویسندگان
چکیده
منابع مشابه
The role of syllables in anagram solution: a Rasch analysis.
Anagrams are frequently used by experimental psychologists interested in how the mental lexicon is organized. Until very recently, research has overlooked the importance of syllable structure in solving anagrams and assumed that solution difficulty was mainly due to frequency factors (e.g., bigram statistics). The present study uses Rasch analysis to demonstrate that the number of syllables is ...
متن کاملRandomized Anagram revisited
When compared to signature-based Intrusion Detection Systems (IDS), anomaly detectors present the potential advantage of detecting previously unseen attacks, which makes them an attractive solution against zero-day exploits and other attacks for which a signature is unavailable. Most anomaly detectors rely on machine learning algorithms to derive a model of normality that is later used to detec...
متن کاملAnaGram: protein function assignment
SUMMARY AnaGram is a web service for protein function assignment based on identity detection of small significant fragments (protomotifs) that can act as modular pieces in peptide construction. The system is able to assign function by finding correlations between protomotifs and functional annotations contained in SWISS-PROT and Medline databases. In addition, function ontologies are used for h...
متن کاملSuperiority of variable to repeated practice in transfer on anagram solution.
Previous research in motor learning shows that practicing variations of a task (variable practice) leads to better transfer than does repeatedly practicing the exact same task (repeated practice). In contrast, research on priming using verbal materials shows that performance on a test improves to the extent that the material at learning and test overlap. We tested whether variability in practic...
متن کاملAnagram-free colorings of graphs
A sequence S is called anagram-free if it contains no consecutive symbols r1r2 . . . rkrk+1 . . . r2k such that rk+1 . . . r2k is a permutation of the block r1r2 . . . rk. Answering a question of Erdős and Brown, Keränen constructed an infinite anagram-free sequence on four symbols. Motivated by the work of Alon, Grytczuk, Ha luszczak and Riordan [2], we consider a natural generalisation of ana...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Psychonomic Society
سال: 1980
ISSN: 0090-5054
DOI: 10.3758/bf03329534